Genetic Programming Hyper-Heuristics with Vehicle Collaboration for Uncertain Capacitated Arc Routing Problems
نویسندگان
چکیده
منابع مشابه
Integer Programming-Based Heuristics for Vehicle Routing Problems
Title of dissertation: INTEGER PROGRAMMING-BASED HEURISTICS FOR VEHICLE ROUTING PROBLEMS Damon J. Gulczynski Doctor of Philosophy, 2010 Dissertation directed by: Professor Bruce Golden Applied Mathematics and Scientific Computation Robert H. Smith School of Business The vehicle routing problem (VRP) has been an active field of study by operations researchers for over 50 years. Many practical ap...
متن کاملEvolutionary Algorithms for Capacitated Arc Routing problems with Time Windows
The Capacitated Arc Routing Problem (CARP) involves vehicles routing, serving a set of arcs in a network. This NP hard problem is extended to take into account time windows, entailing a new and hard theoretical model in arc routing called the CARPTW (CARP with time windows). The CARPTW is useful for modeling urban waste collection or winter gritting. This paper presents this new model and a mem...
متن کاملCapacitated Vehicle Routing Problems Based on Multi-heuristics with Balanced Search Control Particle Swarm Optimization
In this article, particle swarm optimization (PSO) is adopted to solve capacitated vehicle routing problems (CVRPs). In order to obtain high quality and diverse initial solutions to facilitate the subsequent search for optimal solutions by PSO, a sweep algorithm is combined with greedy randomized adaptive search procedure (GRASP) to produce high quality initial solutions, and an initial heurist...
متن کاملAn Imperialist Competitive Algorithm and a Mixed Integer Programming Formulation for the Capacitated Vehicle Routing Problem
The Vehicle Routing Problem (VRP), a famous problem of operation research, holds a central place in combinatorial optimization problems. In this problem, a fleet vehicles with Q capacity start to move from depot and return after servicing to customers in which visit only ones each customer and load more than its capacity not at all. The objective is to minimize the number of used vehicles and t...
متن کاملAn Improved Particle Swarm Optimization for a Class of Capacitated Vehicle Routing Problems
Vehicle Routing Problem (VRP) is addressed to a class of problems for determining a set of vehicle routes, in which each vehicle departs from a given depot, serves a given set of customers, and returns back to the same depot. On the other hand, simultaneous delivery and pickup problems have drawn much attention in the past few years due to its high usage in real world cases. This study, therefo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Evolutionary Computation
سال: 2020
ISSN: 1063-6560,1530-9304
DOI: 10.1162/evco_a_00267